On the Choosability of Claw-Free Perfect Graphs
نویسندگان
چکیده
منابع مشابه
Claw-free circular-perfect graphs
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs form a superclass of perfect graphs defined by means of this more general coloring concept. This paper studies claw-free circular-perfect graphs. First we prove that ifG is a connected claw-free circular-perfect graph with χ(G) > ω(G), then min{α(G), ω(G)} = 2. We use this resu...
متن کاملOn claw-free t-perfect graphs
A graph is called t-perfect, if its stable set polytope is defined by nonnegativity, edge and odd-cycle inequalities. We characterise the class of all claw-free t-perfect graphs by forbidden t-minors. Moreover, we show that claw-free t-perfect graphs are 3-colourable. Such a colouring can be obtained in polynomial time.
متن کاملThe Structure of Claw-Free Perfect Graphs
In 1988, Chvátal and Sbihi [4] proved a decomposition theorem for claw-free perfect graphs. They showed that claw-free perfect graphs either have a clique-cutset or come from two basic classes of graphs called elementary and peculiar graphs. In 1999, Maffray and Reed [6] successfully described how elementary graphs can be built using line-graphs of bipartite graphs using local augmentation. How...
متن کاملOn the choice number of claw-free perfect graphs
We prove that every 3-chromatic claw-free perfect graph is 3-choosable. c © 2003 Elsevier B.V. All rights reserved.
متن کاملEven Pairs in Claw-Free Perfect Graphs
An even pair in a graph is a pair of non-adjacent vertices such that every chordless path between them has even length. A graph is called strict quasi-parity when every induced subgraph that is not a clique has an even pair, and it is called perfectly contractile when every induced subgraph can be turned into a clique through a sequence of even-pair contractions. In this paper we determine the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2016
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-016-1732-9